Exploiting partial order with Quicksort
نویسندگان
چکیده
منابع مشابه
Exploiting Partial Order with Quicksort
The widely known Quicksort algorithm does not attempt to actively take advantage of partial order in sorting data. A relatively simple change can be made to the Quicksort strategy to give a bestcase performance of n. for ordered data. with a smooth transition to O(n log n) for the random data case. An attractive attribute of this new algorithm CTransort> Is that its performance for random data ...
متن کاملPartial quicksort and weighted branching processes
In this dissertation we look at different two models of sorting algorithms based on divideand-conquer algorithms. Quicksort algorithm, sort an unsorted array of n distinct elements. Partial Quicksort sorts the l smallest elements in a list of length n. Both stochastic divide-and-conquer algorithms are widely studied. Our algorithm Quicksort on the fly provides online the first smallest, then se...
متن کاملExploiting Distribution and Atomic Transactions for Partial Order Reduction
We present a method for systematic examination and reduction of the state space of distributed systems. The approach exploits properties of distributed systems to partition processes into atomic transitions and uses observations about partial orders among the distributed components to perform dynamic partial order reduction for state space reduction. This report concentrates on preserving reach...
متن کاملEconomic order quantity with partial backordering and sampling inspection
To access the efficient inventory system, managers should consider all the situations that have happened in reality. One of these situations is the presence of the defective items in each received lot and the other situation is being the group of customers that do not wait to fulfill their requirements from the vendor and choose another one to get their orders so the proportion of the backorder...
متن کاملExploiting Partial Annotations with EM Training
For many NLP tasks, EM-trained HMMs are the common models. However, in order to escape local maxima and find the best model, we need to start with a good initial model. Researchers suggested repeated random restarts or constraints that guide the model evolution. Neither approach is ideal. Restarts are time-intensive, and most constraint-based approaches require serious re-engineering or externa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software: Practice and Experience
سال: 1984
ISSN: 0038-0644,1097-024X
DOI: 10.1002/spe.4380140603